Homing Sequence Derivation With Quantified Boolean Satisfiability

Homing sequence derivation for nondeterministic finite state machines (NFSMs) has important applications in software/hardware system testing and verification. Unlike prior methods based on explicit tree-based search, this article we formulate the of a preset/adaptive homing terms quantified Boolean formula (QBF) solving. This formulation exploits compact circuit representation NFSMs QBF encoding existence condition effective computation. The implicit effectively avoids enumeration, can be more scalable. Different schemes solvers are evaluated their suitability derivation. Experiments various computation benchmarks show generality feasibility proposed approach.